Mixing of Random Walks and Other Diiusions on a Graph

We survey results on two diiusion processes on graphs: random walks and chip-ring (closely related to the \abelian sandpile" or \avalanche" model of self-organized criticality in statistical mechanics). Many tools in the study of these processes are common, and results on one can be used to obtain results on the other. We survey some classical tools in the study of mixing properties of random walks; then we introduce the notion of \access time" between two distributions on the nodes, and show that it has nice properties. Surveying and extending work of Aldous, we discuss several notions of mixing time of a random walk. Then we describe chip-ring games, and show how these new results on random walks can be used to improve earlier results. We also give a brief illustration how general results on chip-ring games can be applied in the study of avalanches.